An Improved Shortest Path Campus Navigation Algorithm

نویسندگان

چکیده

Navigation within college campuses can be a challenging task for students, staff, and visitors. With the increasing reliance on smartphones as common utility, it is possible to develop dedicated navigation system aid in navigating these complex environments. In an effort improve upon traditional methods, we explored use of A* algorithm identified opportunity enhance its performance by implementing bidirectional search. This allows search simultaneously from both start end points, reducing space improving efficiency. Additionally, utilized caching mechanism store previously calculated paths, which reuse values further performance. Our approach offers unique solution problem has potential significantly user experience.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Dijkstra Shortest Path Algorithm

An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed to adapt to different network complexity. ...

متن کامل

An Improved Physarum polycephalum Algorithm for the Shortest Path Problem

Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P. polycephalum is originally famous as a computing biological substrate due to its alleged ability to approximate shortest path from its inoculation site to a source of nut...

متن کامل

Shortest path navigation algorithm for driverless plug-in electric vehicles

Driverless plug-in electric vehicles (DPEVs) have attracted a growing attention in transport engineering due to their low environmental impact and increased level of automation. When compared to regular internal combustion engine vehicles, DPEVs have two characteristics: 1) DPEVs require a higher frequency of recharge operations; 2) DPEVs are controlled by predetermined intelligent algorithms, ...

متن کامل

An improved FPTAS for Restricted Shortest Path

Given a graph with a cost and a delay on each edge, Restricted Shortest Path (RSP) aims to find a min-cost s–t path subject to an end-to-end delay constraint. The problem is NP-hard. In this note we present an FPTAS with an improved running time of O(mn/ε) for acyclic graphs, where m and n denote the number of edges and nodes in the graph. Our algorithm uses a scaling and rounding technique sim...

متن کامل

An Adaptive Distributed Dijkstra Shortest Path Algorithm

We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indian Scientific Journal Of Research In Engineering And Management

سال: 2023

ISSN: ['2582-3930']

DOI: https://doi.org/10.55041/ijsrem19175